CPI: A Novel Three-Phase Algorithm for QoS-Aware Replica Placement Problem
نویسندگان
چکیده
QoS-aware replica placement decides how many replicas are needed and where to deploy them to meet every request from individual clients. In this paper, a novel three-phase algorithm, namely CPI, is proposed. By dividing candidate nodes into proper medium-scale partitions, CPI is capable to handle with large-scale QoS-aware replica placement problem. Pharos-based clustering algorithm obtains ideal grouping, and partition integrating method is developed to obtain final replica policy. Theoretical analysis and experiments show that CPI has lower computation complexity and good scalability. The replicating cost and updating cost remains acceptable under different simulating conditions.
منابع مشابه
Automatic QoS-aware Web Services Composition based on Set-Cover Problem
By definition, web-services composition works on developing merely optimum coordination among a number of available web-services to provide a new composed web-service intended to satisfy some users requirements for which a single web service is not (good) enough. In this article, the formulation of the automatic web-services composition is proposed as several set-cover problems and an approxima...
متن کاملThe Quality of Availability: Tackling the Replica Placement Problem
The importance of satisfying the availability of service and its data is becoming the most critical factor which decides the successfulness of the Internet-based services and applications. In this work, we take the availability issue into account as a QoS focus, and evaluate the achieved quality of a service by answering the question 'how much the service satisfies the required availability?'. ...
متن کاملQuality of availability for widely distributed and replicated content stores
As the Internet continues to experience a tremendous expansion in number of users and services today, the importance of satisfying service availability becomes recently one of the most critical factors for the success of “Internet services” such as the World Wide Web, peer-to-peer file sharing and digital audio/video streaming. In this thesis, we take an availability-centric view on end-to-end ...
متن کاملOptimal Closest Policy with QoS and Bandwidth Constraints for Placing Replicas in Tree Networks
This paper deals with the replica placement problem on fully homogeneous tree networks known as the Replica Placement optimization problem. The client requests are known beforehand, while the number and location of the servers are to be determined. We investigate the latter problem using the Closest access policy when adding QoS and bandwidth constraints. We propose an optimal algorithm in two ...
متن کاملA QoS-Aware Intelligent Replica Management Architecture for Content Distribution in Peer-to-Peer Overlay Networks
The large scale content distribution systems were improved broadly using the replication techniques. The demanded contents can be brought closer to the clients by multiplying the source of information geographically, which in turn reduce both the access latency and the network traffic. The system scalability can be improved by distributing the load across multiple servers which is proposed by r...
متن کامل